Ensembles of reference networks based on the rich–club structure for non–evolving networks

نویسنده

  • Raul J. Mondragón
چکیده

In networks the rich nodes are the subset of nodes with large numbers of links, or high degrees. The rich nodes and the connectivity between themselves (rich–club connectivity) tend to dominate the organisation of network structure. Recently there has been a considerable effort to characterise and model the rich–club connectivity in a variety of complex networks. In this paper we firstly clarify a number of terms: the rich-club coefficient quantifies the density of connectivity between a subset of rich nodes; the rich-club structure is the rich-club coefficient measured across the hierarchies of nodes; the rich-club phenomenon refers to the dynamic behaviour responsible for the formation of the rich–club connectivity in evolving networks; and the rich-club ordering discerns whether the connectivity between rich nodes in a nonevolving network (i.e. closed network or network snapshot) is higher than a reference network obtained by network randomisation. We then evaluate a recently proposed null model which is based on an ensemble of reference networks conserving the degree distribution of the original network. We remark that one should not confuse the rich-club structure of a network with the rich-club ordering detected by the null model. We also demonstrate that the null model cannot identify the dynamical mechanism that generates the rich–club connectivity. The main contribution of the paper is that we introduce two new ensembles of reference networks based on the rich-club structure for non–evolving networks. The first ensemble preserves the rich-club coefficient (as a function of the rank of a node) of the original network. Members of the ensemble exhibit similar degree distribution as the original network, and for assortative networks, similar assortative mixing as well. We propose that this ensemble can be used to study networks where assortativeness is a fundamental property, e.g. to detect the community structure in social networks. Analysis on the ensemble also provides a different way to interpret and model the evolution of social networks. The second ensemble preserves both the degree distribution and the rich–club coefficient (as a function of node degree). The reference networks in this ensemble have a similar structure as the original network. We use them to quantify the correlation profile between the rich nodes and pinpoint which links between the nodes are the backbone of network structure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ensembles related to the rich-club coefficient for non-evolving networks

In networks the rich nodes are the subset of nodes with large numbers of links, or high degrees. The rich nodes and the connectivity between themselves (rich–club connectivity) tend to dominate the organisation of network structure. Recently there has been a considerable effort to characterise and model the rich–club connectivity in a variety of complex networks. In this paper we firstly clarif...

متن کامل

Ensembles based on the Rich-Club and how to use them to build soft-communities

Ensembles of networks are used as null–models to discriminate network structures. We present an efficient algorithm, based on the maximal entropy method to generate network ensembles defined by the degree sequence and the rich–club coefficient. The method is applicable for unweighted, undirected networks. The ensembles are used to generate correlated and uncorrelated null–models of a real netwo...

متن کامل

Accuracy Improvement of Tropospheric Delay Interpolation in RTK Networks

The effect of troposphere on the signals emitted from global navigation satellite system (GNSS) satellites, appears as an extra delay in the measurement of the signal traveling from the satellite to receiver. This delay depends on the temperature, pressure, humidity as well as the transmitter and receiver antennas location. In GNSS positioning, tropospheric delay effects on accuracy of differen...

متن کامل

A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets

A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008